package leetcode_acm.leetcode_1;

/**
 * 功能描述
 *
 * @author: 张庭杰
 * @date: 2023年03月17日 12:17
 */
public class CountRangeSum {
    private int[] memo;
    private int[] preSum;
    public int countRangeSum(int[] nums, int lower, int upper) {
        int n = nums.length;
        memo = new int[n];
        return 0;
    }
    private void merge(int[] nums,int l,int mid,int r){
        if (r + 1 - l >= 0) {
            System.arraycopy(nums, l, memo, l, r + 1 - l);
        }

    }
    private void sort(int[] nums,int l,int r){
        if(l >= r){
            return;
        }
        int mid = l+((r-l)>>1);
        sort(nums,l,mid);
        sort(nums,mid+1,r);
        merge(nums,l,mid,r);
    }
}
